First-passage properties of the Erdos–Renyi random graph
نویسندگان
چکیده
منابع مشابه
First-passage properties of the Erdős–Renyi random graph
We study the mean time for a random walk to traverse between two arbitrary sites of the Erdó́s–Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as all moments of this first-passage time, are insensitive to the fraction p of occupied links. This prediction qualitatively agrees with numerical simulations...
متن کاملFirst passage percolation on the random graph
We study first passage percolation on the random graph Gp(N) with exponentially distributed weights on the links. For the special case of the complete graph this problem can be described in terms of a continuous time Markov chain and recursive trees. The Markov chain X(t) describes the number of nodes that can be reached from the initial node in time t. The recursive trees, which are uniform tr...
متن کاملFirst-passage properties of bursty random walks
We investigate the first-passage properties of bursty random walks on a finite one-dimensional interval of length L, in which unit-length steps to the left occur with probability close to one, while steps of length b to the right— ‘bursts’—occur with small probability. This stochastic process provides a crude description of the early stages of virus spread in an organism after exposure. The int...
متن کاملFirst Passage Percolation on the Erdős-Rényi Random Graph
In this paper we explore first passage percolation (FPP) on the Erdős-Rényi random graph Gn(pn), where each edge is given an independent exponential edge weight with rate 1. In the sparse regime, i.e., when npn → λ > 1, we find refined asymptotics both for the minimal weight of the path between uniformly chosen vertices in the giant component, as well as for the hopcount (i.e., the number of ed...
متن کاملFirst-Passage Exponents of Multiple Random Walks
We investigate first-passage statistics of an ensemble of N noninteracting random walks on a line. Starting from a configuration in which all particles are located in the positive half-line, we study Sn(t), the probability that the nth rightmost particle remains in the positive half-line up to time t. This quantity decays algebraically, Sn(t) ∼ tn , in the long-time limit. Interestingly, there ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2004
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/38/1/007